Ordered Reliability Bits Guessing Random Additive Noise Decoding

نویسندگان

چکیده

Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest performance shorter, higher-rate error correcting codes, and raising possibility revisiting universal, code-agnostic decoders. To end, here we introduce a soft-detection variant Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND can accurately decode any moderate redundancy block-code. It is designed circuit implementation mind, determines accurate decodings while retaining original hard detection algorithm's suitability highly parallelized ORBGRAND shown to provide excellent soft decision block distinct classes (BCH, CA-Polar RLC) modest complexity, providing better rate than CA-SCL, state art decoder. offers an accurate, energy decoder suitable delivering URLLC single hardware realization.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity-achieving decoding by guessing noise

We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in channels with memory. The algorithm is based on the principle that the receiver rank orders noise sequences from most likely to least likely. Subtracting noise from the received signal in that order, the first instance that results in an element of the code-book is the ML decoding. For channels where the noise is ind...

متن کامل

Random Search under Additive Noise

From the early days in his career, Sid Yakowitz showed interest in noisy function optimization. He realized the universality of random search as an optimization paradigm, and was particularly interested in the minimization of functions Q without making assumptions on the form of Q. Especially the noisy optimization problem appealed to him, as exact computations of Q come often at a tremendous c...

متن کامل

Decoding Ldpc Codes over Binary Channels with Additive Markov Noise

We study the design of a belief propagation decoder for lowdensity parity check (LDPC) codes over binary channels with additive M th-order Markov noise, specifically the queuebased channel (QBC) [1]. The decoder is an extension of the sum product algorithm (SPA) for the case of memoryless channels and is similar to the one developed for the GilbertElliot channel [2, 3, 4]. Simulation results of...

متن کامل

Nearest neighbor decoding for additive non-Gaussian noise channels

We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original c...

متن کامل

Guessing More Secrets via List Decoding

We consider the following game introduced by Chung, Graham, and Leighton in [Chung et al. 01]. One player, A, picks k > 1 secrets from a universe of N possible secrets, and another player, B, tries to gain as much information about this set as possible by asking binary questions f : [N ] −→ {0, 1}. Upon receiving a question f , A adversarially chooses one of her k secrets, and answers f accordi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3203251